The existing monocular depth estimation methods often use image semantic information to obtain depth， and ignore another important cue — defocus blur. At the same time， the defocus blur based depth estimation methods usually take the focal stack or gradient information as input， and do not consider the characteristics of the small variation of blur between image layers of the focal stack and the blur ambiguity on both sides of the focal plane. Aiming at the deficiencies of the existing focal stack depth estimation methods， a lightweight network based on three-dimensional convolution was proposed. Firstly， a Three-Dimensional perception module was designed to roughly extract the blur information of the focal stack. Secondly， the extracted information was concatenated with the difference features of the focal stack RGB channels output by a channel difference module to construct a focus volume that was able to identify the blur ambiguity patterns. Finally， a multi-scale three-dimensional convolution was used to predict the depth. Experimental results show that compared with methods such as All in Focus Depth Network （AiFDepthNet）， the proposed method achieves the best on seven indicators such as Mean Absolute Error （MAE） on DefocusNet dataset， and the best on four indicators as well as the suboptimal on three indicators on NYU Depth V2 dataset； at the same time， the lightweight design reduces the inference time of the proposed method by 43.92% to 70.20% and 47.91% to 77.01% on two datasets respectively. The above verifies that the proposed method can effectively improve the accuracy and inference speed of focal stack depth estimation.

The variable-length address is one of the important research content in the field of future network. Aiming at the low efficiency of traditional routing lookup algorithms for variable-length address， an efficient routing lookup algorithm suitable for variable-length addresses based on balanced binary tree — AVL （Adelson-Velskii and Landis） tree and Bloom filter， namely AVL-Bloom algorithm， was proposed. Firstly， multiple off-chip hash tables were used to separately store route entries with the same number of prefix bits and their next-hop information in view of the flexible and unbounded characteristics of the variable-length address. Meanwhile， the on-chip Bloom filter was utilized for speeding up the search for route prefixes that were likely to match. Secondly， in order to solve the problem that the routing lookup algorithms based on hash technology need multiple hash comparisons when searching for the route with the longest prefix， the AVL tree technology was introduced， that was， the Bloom filter and hash table of each group of route prefix set were organized through AVL tree， so as to optimize the query order of route prefix length and reduce the number of hash calculations and then decrease the search time. Finally， comparative experiments of the proposed algorithm with the traditional routing lookup algorithms such as METrie （Multi-Entrance-Trie） and COBF （Controlled prefix and One-hashing Bloom Filter） were conducted on three different variable-length address datasets. Experimental results show that the search speed of AVL-Bloom algorithm is significantly faster than those of METrie and COBF algorithms， and the query time is reduced by nearly 83% and 64% respectively. At the same time， AVL-Bloom algorithm can maintain stable search performance under the condition of large change in routing table entries， and is suitable for routing lookup and forwarding with variable-length addresses.

KGE(Knowledge Graph Embedding） maps entities and relationships into a low-dimensional continuous vector space， uses machine learning methods to implement relational data applications， such as knowledge analysis， reasoning， and completion. Taking ConvE （Convolution Embedding） as a representative， CNN （Convolutional Neural Network） is applied to knowledge graph embedding to capture the interactive information of entities and relationships， but the ability of the standard convolutional to capture feature interaction information is insufficient， and its feature expression ability is low. Aiming at the problem of insufficient feature interaction ability， an improved Inception structure was proposed， based on which a knowledge graph embedding model named InceE was constructed. Firstly， hybrid dilated convolution replaced standard convolution to improve the ability to capture feature interaction information. Secondly， the residual network structure was used to reduce the loss of feature information. The experiments were carried out on the datasets Kinship， FB15k， WN18 to verify the effectiveness of link prediction by InceE. Compared with ArcE and QuatRE models on the Kinship and FB15k datasets， the Hit@1 of InceE increased by 1.6 and 1.5 percentage points； compared with ConvE on the three datasets， the Hit@1 of InceE increased by 6.3， 20.8， and 1.0 percentage points. The experimental results show that InceE has a stronger ability to capture feature interactive information.